a community forest case-study in Tanzania

The current debate on climate change, especially with respect to the role of REDD projects and the push for the recognition of community (participatory) forest management as a carbon mitigation option represents a potential for communities to receive benefits from carbon sequestration. A recent study in Tanzania has estimated that communities can receive financial benefits in thousands of US$ annually from the sale of their forest carbon credits. This notwithstanding, such kind of projects is expected to generate potential social and environmental costs with related risks of conflicts if benefit sharing and governance issues are not well addressed. However the identification and prioritization as well as the economic value of all these benefits and costs are still premature. An understanding of what these expected benefits from sustainable forest management and REDD projects are, how their (total) value can be assessed and who are stakeholders and actors in participatory forest management (PFM) can be useful in formulating equitable benefit sharing mechanisms based on principles of “good governance” that could be adopted in REDD projects implementation. The paper deals with these topics on the basis of empirical results based on a participatory action research carried out in the Angai Village Land Forest Reserve, Liwale District, in Tanzania in 2010. Guidelines for formulating governance mechanisms to reduce risks of negative social consequences and enhance benefits from PFM_REDD projects for local forest resources management are proposed. Equitable benefit sharing in PFM is considered one of the most important issues for community cohesion and conflicts solving/managing and in the avoidance of leakage or other risks in REDD projects

Key-Policy Attribute-Based Encryption for Boolean Circuits from Bilinear Maps

We propose the first Key-policy Attribute-based Encryption (KP-ABE) scheme for (monotone) Boolean circuits based on bilinear maps. The construction is based on secret sharing and just one bilinear map, and can be viewed as an extension of the KP-ABE scheme in [7]. Selective security of the proposed scheme in the standard model is proved, and comparisons with the scheme in [5] based on leveled multilinear maps, are provided. Thus, for Boolean circuits representing multilevel access structures, our KP-ABE scheme is more efficient than the one in [5]

Ideal hierarchical secret sharing schemes

Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention from the invention of secret sharing until nowadays. Several constructions of ideal hierarchical secret sharing schemes have been proposed, but it was not known what access structures admit such a scheme. We solve this problem by providing a natural definition for the family of the hierarchical access structures and, more importantly, by presenting a complete characterization of the ideal hierarchical access structures, that is, the ones admitting an ideal secret sharing scheme. Our characterization deals with the properties of the hierarchically minimal sets of the access structure, which are the minimal qualified sets whose participants are in the lowest possible levels in the hierarchy. By using our characterization, it can be efficiently checked whether any given hierarchical access structure that is defined by its hierarchically minimal sets is ideal. We use the well known connection between ideal secret sharing and matroids and, in particular, the fact that every ideal access structure is a matroid port. In addition, we use recent results on ideal multipartite access structures and the connection between multipartite matroids and integer polymatroids. We prove that every ideal hierarchical access structure is the port of a representable matroid and, more specifically, we prove that every ideal structure in this family admits ideal linear secret sharing schemes over fields of all characteristics. In addition, methods to construct such ideal schemes can be derived from the results in this paper and the aforementioned ones on ideal multipartite secret sharing. Finally, we use our results to find a new proof for the characterization of the ideal weighted threshold access structures that is simpler than the existing one.Peer ReviewedPostprint (author's final draft

Carbamazepine alone and in combination with doxycycline attenuates isoproterenol-induced cardiac hypertrophy

β-adrenergic signaling is involved in the development of cardiac hypertrophy (CH), justifying the use of β-blockers as a therapy to minimize and postpone the consequences of this disease. Evidence suggests that adenylate cyclase, a downstream effector of the β-adrenergic pathway, might be a therapeutic target. We examined the effects of the anti-epileptic drug carbamazepine (CBZ), an inhibitor of adenylate cyclase. In a murine cardiac hypertrophy model, carbamazepine significantly attenuates isoproteronol (ISO)-induced cardiac hypertrophy. Carbamazepine also has an effect in transverse aortic banding induced cardiac hypertrophy (TAB) (P=0.07). When carbamazepine was given in combination with the antibiotic doxycycline (DOX), which inhibits matrix metalloproteinases (MMPs), therapeutic outcome measured by heart weight-to-body weight and heart weight-to-tibia length ratios was improved compared to either drug alone. Additionally, the combination therapy resulted in an increase in the survival rate over a 56-day period compared to that of untreated mice with cardiac hypertrophy or either drug used alone. Moreover, in support of a role for carbamaze -pine as a β-adrenergic antagonist via cAMP inhibition, a lower heart rate and a lower level of the activated phosphorylated form of the cAMP Response Element-Binding (CREB) were observed in heart extracts from mice treated with carbamazepine. Gene expression analysis identified 19 genes whose expression is significantly altered in treated animals and might be responsible for the added benefit provided by the combination therapy. These results suggest that carbamazepine acts as a β-adrenergic antagonist. Carbamazepine and doxycycline are approved by the US Food and Drug Administration (FDA) as drugs that might complement medications for cardiac hypertrophy or serve as an alternative therapy to traditional β-blockers. Furthermore, these agents reproducibly impact the expression of genes that may serve as additional therapeutic targets in the management of cardiac hypertrophy

Linear Bellman combination for control of character animation

Controllers are necessary for physically-based synthesis of character animation. However, creating controllers requires either manual tuning or expensive computer optimization. We introduce linear Bellman combination as a method for reusing existing controllers. Given a set of controllers for related tasks, this combination creates a controller that performs a new task. It naturally weights the contribution of each component controller by its relevance to the current state and goal of the system. We demonstrate that linear Bellman combination outperforms naive combination often succeeding where naive combination fails. Furthermore, this combination is provably optimal for a new task if the component controllers are also optimal for related tasks. We demonstrate the applicability of linear Bellman combination to interactive character control of stepping motions and acrobatic maneuvers.Singapore-MIT GAMBIT Game LabNational Science Foundation (U.S.) (Grant 2007043041)National Science Foundation (U.S.) (Grant CCF-0810888)Adobe SystemsPixar (Firm

Efficient Explicit Constructions of Multipartite Secret Sharing Schemes

Multipartite secret sharing schemes are those having a multipartite access structure, in which the set of participants is divided into several parts and all participants in the same part play an equivalent role. Secret sharing schemes for multipartite access structures have received considerable attention due to the fact that multipartite secret sharing can be seen as a natural and useful generalization of threshold secret sharing. This work deals with efficient and explicit constructions of ideal multipartite secret sharing schemes, while most of the known constructions are either inefficient or randomized. Most ideal multipartite secret sharing schemes in the literature can be classified as either hierarchical or compartmented. The main results are the constructions for ideal hierarchical access structures, a family that contains every ideal hierarchical access structure as a particular case such as the disjunctive hierarchical threshold access structure and the conjunctive hierarchical threshold access structure, the constructions for three families of compartmented access structures, and the constructions for two families compartmented access structures with compartments. On the basis of the relationship between multipartite secret sharing schemes, polymatroids, and matroids, the problem of how to construct a scheme realizing a multipartite access structure can be transformed to the problem of how to find a representation of a matroid from a presentation of its associated polymatroid. In this paper, we give efficient algorithms to find representations of the matroids associated to several families of multipartite access structures. More precisely, based on know results about integer polymatroids, for each of those families of access structures above, we give an efficient method to find a representation of the integer polymatroid over some finite field, and then over some finite extension of that field, we give an efficient method to find a presentation of the matroid associated to the integer polymatroid. Finally, we construct ideal linear schemes realizing those families of multipartite access structures by efficient methods

Disrupted in Schizophrenia 1 Regulates Neuronal Progenitor Proliferation via Modulation of GSK3β/β-Catenin Signaling

The Disrupted in Schizophrenia 1 (DISC1) gene is disrupted by a balanced chromosomal translocation (1; 11) (q42; q14.3) in a Scottish family with a high incidence of major depression, schizophrenia, and bipolar disorder. Subsequent studies provided indications that DISC1 plays a role in brain development. Here, we demonstrate that suppression of DISC1 expression reduces neural progenitor proliferation, leading to premature cell cycle exit and differentiation. Several lines of evidence suggest that DISC1 mediates this function by regulating GSK3β. First, DISC1 inhibits GSK3β activity through direct physical interaction, which reduces β-catenin phosphorylation and stabilizes β-catenin. Importantly, expression of stabilized β-catenin overrides the impairment of progenitor proliferation caused by DISC1 loss of function. Furthermore, GSK3 inhibitors normalize progenitor proliferation and behavioral defects caused by DISC1 loss of function. Together, these results implicate DISC1 in GSK3β/β-catenin signaling pathways and provide a framework for understanding how alterations in this pathway may contribute to the etiology of psychiatric disorders.National Alliance for Research on Schizophrenia and Depression (U.S.) (Young Investigator Award)Natural Sciences and Engineering Research Council of Canada (Postdoctoral Award)Human Frontier Science Program (Strasbourg, France) (Fellowship)Singleton FellowshipNational Institutes of Health (U.S.) (Grant NS37007

Lipidoid-Coated Iron Oxide Nanoparticles for Efficient DNA and siRNA delivery

The safe, targeted and effective delivery of gene therapeutics remains a significant barrier to their broad clinical application. Here we develop a magnetic nucleic acid delivery system composed of iron oxide nanoparticles and cationic lipid-like materials termed lipidoids. Coated nanoparticles are capable of delivering DNA and siRNA to cells in culture. The mean hydrodynamic size of these nanoparticles was systematically varied and optimized for delivery. While nanoparticles of different sizes showed similar siRNA delivery efficiency, nanoparticles of 50–100 nm displayed optimal DNA delivery activity. The application of an external magnetic field significantly enhanced the efficiency of nucleic acid delivery, with performance exceeding that of the commercially available lipid-based reagent, Lipofectamine 2000. The iron oxide nanoparticle delivery platform developed here offers the potential for magnetically guided targeting, as well as an opportunity to combine gene therapy with MRI imaging and magnetic hyperthermia.National Heart, Lung, and Blood InstituteNational Institutes of Health (U.S.) (Program of Excellence in Nanotechnology (PEN) Award, Contract #HHSN268201000045C

Communication-Efficient Proactive Secret Sharing for Dynamic Groups with Dishonest Majorities

In standard Secret Sharing (SS), a dealer shares a secret $s$ among $n$ parties such that an adversary corrupting no more than $t$ parties does not learn $s$, while any $t+1$ parties can efficiently recover $s$. Proactive Secret Sharing (PSS) retains confidentiality of $s$ even when a mobile adversary corrupts all parties over the lifetime of the secret, but no more than a threshold $t$ in each epoch (called a refresh period). Withstanding such adversaries has become of increasing importance with the emergence of settings where private keys are secret shared and used to sign cryptocurrency transactions, among other applications. Feasibility of single-secret PSS for static groups with dishonest majorities was demonstrated but with a protocol that requires inefficient communication of $O(n^4)$. In this work, we improve over prior work in three directions: batching without incurring a linear loss in corruption threshold, communication efficiency, and handling dynamic groups. While each of properties we improve upon appeared independently in the context of PSS and in other previous work, handling them simultaneously (and efficiently) in a single scheme faces non-trivial challenges. Some PSS protocols can handle batching of $\ell \sim n$ secrets, but all of them are for the honest majority setting. Techniques typically used to accomplish such batching decrease the tolerated corruption threshold bound by a linear factor in $\ell$, effectively limiting the number of elements that can be batched with dishonest majority. We solve this problem by reducing the threshold decrease to $\sqrt{\ell}$ instead, allowing us to deal with the dishonest majority setting when $\ell \sim n$. This is accomplished based on new bivariate-polynomials-based techniques for sharing, and refreshing and recovering of shares, that allow batching of up to $n-2$ secrets in our PSS. To tackle the efficiency bottleneck the constructed PSS protocol requires only $O(n^3/\ell)$ communication for $\ell$ secrets, i.e., an amortized communication complexity of $O(n^2)$ when the maximum batch size is used. To handle dynamic groups we develop three new sub-protocols to deal with parties joining and leaving the group